1. Aufzahlbarkeit, Entscheidbarkeit, Berechenbarkeit; Einfuhrung in die Theorie der rekursiven Funktionen
Author: Hermes, Hans.
Library: Central Library of Sharif University of Technology (Tehran)
Subject: ، Recursive functions,، Algorithms,، Godel's theorem,، Computable functions
Classification :
QA
248
.
5
.
H4
1971
2. Enumerability, decidability, computability. An introduction to the theory of recursive functions
Author: Hermes, Hans.
Library: Central Library of Sharif University of Technology (Tehran)
Subject: ، Recursive functions,، Algorithms,، Godel's theorem
Classification :
QA
248
.
5
.
H413
1969
3. Enumerability decidability computability : an introduction to the theory of recursive functions
Author: Hans Hermes; translated by G.T. Hermann and O. Plassmann
Library: Library of Institute for Research in Fundamental Sciences (Tehran)
Subject: ، Recursive functions,، Algorithms,، Godel's theorem
Classification :
QA
248
.
5
.
H413
1969
4. Enumerability, decidability, computability; an introduction to the theory of recursive functions
Author: / by Hans Hermes. Translated by G.T Herman and O. Plassmann
Library: Library of College of Science University of Tehran (Tehran)
Subject: Recursive functions,Algorithms,Godel's theorem,Computable functions
Classification :
QA
248
.
5
.
H413
